Graphillion: software library for very large sets of labeled graphs
نویسندگان
چکیده
منابع مشابه
Graphillion: Software Library Designed for Very Large Sets of Graphs in Python
Several graph libraries have been developed in the past few decades, but they were designed to work with a few graphs even though the number of subgraphs exponentially increases with graph size. In this paper, we develop Graphillion, a software library for very large sets of graphs. Graphillion is not established on a traditional representation of graphs. Instead, a graph set is simply regarded...
متن کاملGraphillion: ZDD-based Software Library for Very Large Sets of Graphs
Graphillion is a library for manipulating very large sets of graphs, based on zero-suppressed binary decision diagrams (ZDDs) with advanced graph enumeration algorithms. Graphillion is implemented as a Python extension in C++, to encourage easy development of its applications without introducing significant performance overhead. Experimental results show that Graphillion allows us to manage an ...
متن کاملSoft Clustering for Very Large Data Sets
Clustering is regarded as one of the significant task in data mining and has been widely used in very large data sets. Soft clustering is unlike the traditional hard clustering which allows one data belong to two or more clusters. Soft clustering such as fuzzy c-means and rough k-means have been proposed and successfully applied to deal with uncertainty and vagueness. However, the influx of ver...
متن کاملRHOG: A Refinement-Operator Library for Directed Labeled Graphs
This document provides the foundations behind the functionality provided by the ρG library 1 , focusing on the basic operations the library provides: subsumption, refinement of directed labeled graphs, and distance/similarity assessment between directed labeled graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal on Software Tools for Technology Transfer
سال: 2014
ISSN: 1433-2779,1433-2787
DOI: 10.1007/s10009-014-0352-z